Triadic Concept Construction Method Based on Candidate Set
WANG Xiao1,2, WEI Ling1,2,3, ZHANG Qin1,2, QI Bin4
1. School of Mathematics, Northwest University, Xi'an 710127; 2. Institute of Concepts, Cognition and Intelligence, Northwest University, Xi'an 710127; 3. School of Mathematics and Statistics, Minnan Normal University, Zhangzhou 363000; 4. School of Computer Science and Technology, Xidian University, Xi'an 710071
Abstract：As an extension of formal concept analysis, triadic concept analysis is a theory for analyzing three-dimensional data. The acquisition of triadic concepts is one of the key issues in triadic concept analysis. A triadic concept construction method based on candidate set is proposed. Firstly, the regular triadic context and the purified triadic context are defined, and properties of these two triadic contexts are studied. Secondly, it is proven that the extent set of all formal concepts of the formal context induced by the triadic context contains the extent set of all triadic concepts of triadic context. Then, by defining an extent candidate set, a method for constructing triadic concepts using the extent candidate set is presented to speed up the acquisition of triadic concepts. Moreover, the feasibility and completeness of obtaining triadic concepts based on this construction method are proven, and this method is extended to two other types of formal contexts induced by the triadic context. Finally, an algorithm for constructing triadic concepts based on the candidate set is presented, and experimental results demonstrate superior performance of the proposed algorithm.
[1] WILLE R. Restructuring Lattice Theory: An Approach Based on Hierarchies of Concepts // RIVAL I, ed. Ordered Sets. Dordrecht, Netherlands: Springer, 1982: 445-470. [2] GANTER B, WILLE R. Formal Concept Analysis: Mathematical Foun-dations. Berlin, Germany: Springer, 1999. [3] 胡可云,陆玉昌,石纯一. 概念格及其应用进展. 清华大学学报(自然科学版), 2000, 40(9): 77-81. (HU K Y, LU Y C, SHI C Y. Advances in Concept Lattice and Its Application. Journal of Tsinghua University(Science & Technology), 2000, 40(9): 77-81.) [4] ZOU C F, ZHANG D Q, WAN J F, et al. Using Concept Lattice for Personalized Recommendation System Design. IEEE Systems Journal, 2017, 11(1): 305-314. [5] NGUYEN P H P, CORBETT D. A Basic Mathematical Framework for Conceptual Graphs. IEEE Transactions on Knowledge and Data Engineering, 2006, 18(2): 261-271. [6] 李金海,魏玲,张卓, 等. 概念格理论与方法及其研究展望.模式识别与人工智能, 2020, 33(7): 619-642. (LI J H, WEI L, ZHANG Z, et al. Concept Lattice Theory and Method and Their Research Prospect. Pattern Recognition and Artificial Intelligence, 2020, 33(7): 619-642.) [7] WILLE R. The Basic Theorem of Triadic Concept Analysis. Order, 1995, 12(2): 149-158. [8] LEHMANN F, WILLE R. A Triadic Approach to Formal Concept Analysis // Proc of the 3rd International Conference on Conceptual Structures. Berlin, Germany: Springer, 1995: 32-43. [9] 魏玲,万青,钱婷,等. 三元概念分析综述. 西北大学学报(自然科学版), 2014, 44(5): 689-699. (WEI L, WAN Q, QIAN T, et al. An Overview of Triadic Concept Analysis. Journal of Northwest University(Natural Science Edition), 2014, 44(5): 689-699.) [10] BIEDERMANN K. An Equational Theory for Trilattices. Algebra Uni-versalis, 1999, 42(4): 253-268. [11] GROH B, WILLE R. Lattices of Triadic Concept Graphs // Proc of the 8th International Conference on Conceptual Structures. Berlin, Germany: Springer, 2000: 332-341. [12] 祁建军,魏玲.三元背景及概念三元格的简化.计算机科学, 2017, 44(9): 53-57. (QI J J, WEI L. Simplification of Triadic Contexts and Concept Trilattices. Computer Science, 2017, 44(9): 53-57.) [13] 魏玲,曹丽,祁建军.三元背景基于二元关系不变的约简.西北大学学报(自然科学版), 2017, 47(3): 313-320. (WEI L, CAO L, QI J J. Reduction Based on the Binary Relations for Triadic Contexts. Journal of Northwest University(Natural Science Edition), 2017, 47(3): 313-320.) [14] BIEDERMANN K. How Triadic Diagrams Represent Conceptual Struc-tures // Proc of the 5th International Conference on Conceptual Structures. Berlin, Germany: Springer, 1997: 304-317. [15] GANTER B, OBIEDKOV S A. Implications in Triadic Formal Con-texts // Proc of the 12th International Conference on Conceptual Structures. Berlin, Germany: Springer, 2004: 186-195. [16] MISSAOUI R, KWUIDA L. Mining Triadic Association Rules from Ternary Relations // Proc of the 9th International Conference on Formal Concept Analysis. Berlin, Germany: Springer, 2011: 204-218. [17] 王蕾晰,吴伟志,谢祯晃.基于熵的多尺度多重集值信息系统的最优尺度选择与属性约简.模式识别与人工智能, 2023, 36(6): 495-510. (WANG L X, WU W Z, XIE Z H. Optimal Scale Selection and Attribute Reduction of Multi-scale Multiset-Valued Information Systems Based on Entropy. Pattern Recognition and Artificial Intelligence, 2023, 36(6): 495-510.) [18] 李俊余,李星璇,王霞,等. 基于三元因子分析的三元概念约简.南京大学学报(自然科学), 2020, 56(4): 480-493. (LI J Y, LI X X, WANG X, et al. Reduction of Triadic Concepts Based on Triadic Factor Analysis. Journal of Nanjing University(Natural Science), 2020, 56(4): 480-493.) [19] 王霞,李俊余,吴伟志.三元概念的布尔矩阵表示方法.计算机科学, 2023, 50(6): 109-115. (WANG X, LI J Y, WU W Z. Boolean Matrix Representation of Triadic Concepts. Computer Science, 2023, 50(6): 109-115.) [20] BAZIN A. A Triadic Generalisation of the Boolean Concept Lattice // Proc of the 17th International Conference on Formal Concept Analysis. Berlin, Germany: Springer, 2023: 95-105. [21] BELOHLAVEK R, OSICKA P. Triadic Concept Lattices of Data with Graded Attributes. International Journal of General Systems, 2012, 41(2): 93-108. [22] KUMAR C A, MOULISWARAN S C, LI J H, et al. Role Based Access Control Design Using Triadic Concept Analysis. Journal of Central South University, 2016, 23(12): 3183-3191. [23] 薛金蓉,安秋生,郑军.概念格的内涵缩减与数据库推理依赖.计算机研究与发展, 2014, 51(1): 96-103. (XUE J R, AN Q S, ZHENG J. Intent Reduction of Concept La-ttice and Database Inference Dependence. Journal of Computer Research and Development, 2014, 51(1): 96-103.) [24] ANANIAS K H A, MISSAOUI R, RUAS P H B, et al. Triadic Concept Approximation. Information Sciences, 2021, 572: 126-146. [25] 王霞,全园,李俊余,等. 三元概念的增量式构造方法.南京大学学报(自然科学), 2022, 58(1): 19-28. (WANG X, QUAN Y, LI J Y, et al. Incremental Construction Method of Triadic Concepts. Journal of Nanjing University(Natural Science ), 2022, 58(1): 19-28.) [26] GAJDOŠ P, SNÁŠEL V. A New FCA Algorithm Enabling Analyzing of Complex and Dynamic Data Sets. Soft Computing, 2014, 18: 683-694.
2024, Vol. 37 
